package 二叉树;

import javax.swing.tree.TreeNode;

public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree = new BinaryTree();
        BinaryTree.TreeNode root = binaryTree.createTree();
        System.out.println(binaryTree.getKLevelNodeCount(root,3));
        System.out.println(binaryTree.getLeafNodeCount(root));
        System.out.println(binaryTree.size(root));
        System.out.println(binaryTree.getHeight(root));
        System.out.println(binaryTree.find(root, 'N'));
    }

}
